Energy-efficient train control: The two-train separation problem on level track
نویسندگان
چکیده
منابع مشابه
On Train Track Splitting Sequences
We present a structure theorem for the subsurface projections of train track splitting sequences. For the proof we introduce induced tracks, efficient position, and wide curves. As a consequence of the structure theorem we prove that train track sliding and splitting sequences give quasi-geodesics in the train track graph; this generalizes a result of Hamenstädt [Invent. Math.].
متن کاملSingle Track Train Scheduling
In this work we consider the Single Track Train Scheduling Problem. The problem consists in scheduling a set of trains from opposite sides along a single track. The track passes intermediate stations and the trains are only allowed to pass each other at those stations. This problem has a close relation to minimizing the makespan in a job shop scheduling problem with two counter routes and no pr...
متن کاملThe track formulation for the Train Dispatching problem
With few exceptions, train movements are still controlled by human operators, the dispatchers. They establish routes and precedence between trains in real-time in order to cope with normal operations but also to recover from deviations from the timetable, and minimize overall delays. Implicitly they tackle and solve repeatedly a hard optimization problem, the Train Dispatching Problem. We recen...
متن کاملReview of energy-efficient train control and timetabling
The energy consumption of trains is highly efficient due to the low friction between steel wheels and rails, although the efficiency is also influenced largely by the driving strategy applied and the scheduled running times in the timetable. Optimal energy-efficient driving strategies can reduce operating costs significantly and contribute to a further increase of the sustainability of railway ...
متن کاملThe train marshalling problem
The problem considered in this paper arose in connection with the rearrangement of railroad cars in China. In terms of sequences the problem reads as follows: contains all the elements of S p(1) , then all elements of S p(2) , : : :, etc., and nally all elements of S p(t). The aim of this paper is to show that the decision problem: \Given numbers n; k and a partition S of f1; 2; :::; ng, is K (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Rail Transport Planning & Management
سال: 2015
ISSN: 2210-9706
DOI: 10.1016/j.jrtpm.2015.10.002